Implementation of CTL Model Checker Update

نویسندگان

  • LAURA F. CACOVEAN
  • Lucian Blaga
  • EMIL M. POPA
  • CRISTINA I. BRUMAR
چکیده

In this paper is presented an update of the model checker CTL. The minimal modifications which appear represent the fundamental concept for model the dynamic system. In the paper used five primitive operations discompose from the operation of a CTL update used already by [1] which are presented their approach of knowledge update the structures of single agent S5 Kripke. Then is willed defined the criteria of minimum change for the update of model CTL based on these primitive operations. The final in this section paper is willed present the algorithm of implement the model CTL updated. The paper [10] is the base of results obtained. Key-Words: CTL Kripke model, CTL model update, modelling systems dynamics, algorithm, atomic propositions, directed graph, implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental CTL Model Checker for Fair States

CTL (Computation Tree Logic) model checking is a formal method for design verification that checks whether the behavior of the verified system is contained in that of the requirements specification. If this check doesn’t pass, the CTL model checker generates a subset of fair states which belongs to the system but not to the specification. In this letter, we present an incremental method which s...

متن کامل

CTL Model Update: Semantics, Computations and Implementation

Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We first propose five primitive operations which capture the basic update of the CTL model, and then define the minimal change criteria for CTL model update based on these primitive operations. We provide essential semantic ...

متن کامل

Implementing a CTL Model checker

This paper discusses the implementation of a branching time temporal logic CTL model checker for the PROD Pr/T-Net Reachability analysis tool. A new algorithm for model checking CTL is presented. This algorithm doesn't need the converse of the transition relation as the EMC algorithm does 4]. The algorithm also provides a counterexample and witness facility using one-pass reachabil-ity graph tr...

متن کامل

Timed CTL Model Checking in Real-Time Maude

This paper presents a timed CTL model checker for RealTime Maude and its semantic foundations. In particular, we give a timed CTL model checking procedure for that is sound and complete for closedbound formulas under a continuous semantics for a fairly large class of systems. An important benefit of our model checker is that it also automatically provides a timed CTL model checker for subsets o...

متن کامل

OCL meets CTL: Towards CTL-Extended OCL Model Checking

In software modeling, the Object Constraint Language (OCL) is an important tool to specify properties that a model has to satisfy. The design of OCL reflects the structure of MOF-based modeling languages like UML and the tight integration results in an intuitive usability. However, OCL allows to express properties in the context of the current state of an instance model only but not with respec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006